Characterization of graphs with infinite cyclic edge connectivity
نویسندگان
چکیده
منابع مشابه
Orientations of infinite graphs with prescribed edge-connectivity
We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex set (while planar graphs show that G need not contain a subdivision of a simple finite graph of lar...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملA polynomial algorithm for cyclic edge connectivity of cubic graphs
In this paper, we develop a polynomial time algorithm to find out all the minilnum cyclic edge cutsets of a 3-regular graph, and therefore to determine the cyclic edge connectivity of a cubic graph. The algorithm is recursive, with complexity bounded by O(n31og2 n). The algorithm shows that the number of mini~um cyclic edge cut sets of a 3-regular graph G is polynornial in v( G) and that the mi...
متن کاملLiftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity
Let G be a graph and let s be a vertex of G. We consider the structure of the set of all lifts of two edges incident with s that preserve edge-connectivity. Mader proved that two mild hypotheses imply there is at least one pair that lifts, while Frank showed (with the same hypotheses) that there are at least (deg(s) − 1)/2 disjoint pairs that lift. We consider the lifting graph: its vertices ar...
متن کاملEdge-connectivity and super edge-connectivity of P2-path graphs
For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.04.055